منابع مشابه
Max-Product Shepard Approximation Operators
In crisp approximation theory the operations that are used are only the usual sum and product of reals. We propose the following problem: are sum and product the only operations that can be used in approximation theory? As an answer to this problem we propose max-product Shepard Approximation operators and we prove that these operators have very similar properties to those provided by the crisp...
متن کاملDecision Sum-Product-Max Networks
Sum-Product Networks (SPNs) were recently proposed as a new class of probabilistic graphical models that guarantee tractable inference, even on models with high-treewidth. In this paper, we propose a new extension to SPNs, called Decision Sum-Product-Max Networks (Decision-SPMNs), that makes SPNs suitable for discrete multi-stage decision problems. We present an algorithm that solves Decision-S...
متن کاملMax Product for Max-Weight Independent Set and Matching
The Max Product (MP) is a local, iterative, message passing style algorithm that has been developed for finding the maximum a posteriori (MAP) assignment of discrete probability distribution specified by a graphical model. The scope of application of MP is vast and in particular it can serve as a heuristic to solve any combinatorial optimization problem. Despite the success of MP algorithm in t...
متن کاملGraph Cuts is a Max-Product Algorithm
The maximum a posteriori (MAP) configuration of binary variable models with submodular graph-structured energy functions can be found efficiently and exactly by graph cuts. Max-product belief propagation (MP) has been shown to be suboptimal on this class of energy functions by a canonical counterexample where MP converges to a suboptimal fixed point (Kulesza & Pereira, 2008). In this work, we s...
متن کاملFaster Algorithms for Max-Product Message-Passing
Maximum A Posteriori inference in graphical models is often solved via message-passing algorithms, such as the junction-tree algorithm, or loopy belief-propagation. The exact solution to this problem is well known to be exponential in the size of the model’s maximal cliques after it is triangulated, while approximate inference is typically exponential in the size of the model’s factors. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1972
ISSN: 0022-247X
DOI: 10.1016/0022-247x(72)90250-8